A Graph Algorithm to Eliminate Hunger and Food Waste by Matching Excess Food to Demand

Millions of tons food from grocery stores go to waste every year in the US, while many people consistently depend on community banks. Having a plan transport surplus needy will eliminate both and hunger at same time. This problem is modeled as bipartite graph with one set vertices representing donors certain excess various types, other banks demand different types food, cost transportation each edge. We create four heuristic algorithms find low-cost plans that satisfy all needs, compare them terms runtime. basic greedy algorithm does best aspects.